Continuously Parameterized Symmetries and Buchberger’s Algorithm
نویسندگان
چکیده
منابع مشابه
Continuously Parameterized Symmetries and Buchberger's Algorithm
Systems of polynomial equations often have symmetries. In solving such a system using Buchberger's algorithm, the symmetries are neglected. Incorporating symmetries into the solution process enables us to solve larger problems than with Buchberger's algorithm alone. This paper presents a method that shows how this can be achieved and also gives an algorithm that brings together continuously par...
متن کاملLearning Convex Combinations of Continuously Parameterized Basic Kernels
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider this problem when the kernel is in the convex hull of basic kernels, for example, Gaussian kernels which are continuously parameterized by a compact set. We show that there always exists an optimal kernel which is the co...
متن کاملSimpler Parameterized Algorithm for OCT
We give a simple and intuitive fixed parameter tractable algorithm for the Odd Cycle Transversal problem, running in time O(3 · k · |E| · |V |). Our algorithm is best viewed as a reinterpretation of the classical Iterative Compression algorithm for Odd Cycle Transversal by Reed, Smith and Vetta [8].
متن کاملParameterized Expectations Algorithm and the Moving Bounds
The Parameterized Expectations Algorithm (PEA) is a powerful tool for solving nonlinear stochastic dynamic models. However, it has an important shortcoming: it is not a contraction mapping technique and thus does not guarantee a solution will be found. We suggest a simple modification that enhances the convergence property of the algorithm. The idea is to rule out the possibility of (ex)implosi...
متن کاملGraph Minors and Parameterized Algorithm Design
The Graph Minors Theory, developed by Robertson and Seymour, has been one of the most influential mathematical theories in parameterized algorithm design. We present some of the basic algorithmic techniques and methods that emerged from this theory. We discuss its direct meta-algorithmic consequences, we present the algorithmic applications of core theorems such as the grid-exclusion theorem, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0478